An algorithm for solving systems of quadratic equations in branching processes
نویسنده
چکیده
We denote by e the vector, of dimensions that are clear by the context, all of whose components are 1. With this notation, a necessary compatibility condition for our model is that e = a+b(e, e), that is, for each i we require the probabilities of all the possible events that can happen to an individual in state i to sum to 1. Markovian binary trees are used not only for population dynamics, but also for instance for modelling computer and networking systems [5]. A natural
منابع مشابه
An accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملAbout One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...
متن کاملA Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations
In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the n...
متن کاملThe Sine-Cosine Wavelet and Its Application in the Optimal Control of Nonlinear Systems with Constraint
In this paper, an optimal control of quadratic performance index with nonlinear constrained is presented. The sine-cosine wavelet operational matrix of integration and product matrix are introduced and applied to reduce nonlinear differential equations to the nonlinear algebraic equations. Then, the Newton-Raphson method is used for solving these sets of algebraic equations. To present ability ...
متن کاملA Three-terms Conjugate Gradient Algorithm for Solving Large-Scale Systems of Nonlinear Equations
Nonlinear conjugate gradient method is well known in solving large-scale unconstrained optimization problems due to it’s low storage requirement and simple to implement. Research activities on it’s application to handle higher dimensional systems of nonlinear equations are just beginning. This paper presents a Threeterm Conjugate Gradient algorithm for solving Large-Scale systems of nonlinear e...
متن کامل